Online k-Server Routing Problems
نویسندگان
چکیده
منابع مشابه
New lower bounds for online k-server routing problems
In a k-server routing problem k ≥ 1 servers move in a metric space in order to visit specified points or carry objects from sources to destinations. In the online version requests arrive online while the servers are traveling. Two classical objective functions are to minimize the makespan, i.e., the time when the last server has completed its tour, (k-Traveling Salesman Problem or k-tsp) and to...
متن کاملOnline vehicle routing problems
The Traveling Salesman Problem (TSP) is maybe the archetypical problem in combinatorial optimization. This problem and its generalizations, vehicle routing problems, have been studied for more than thirty years; two entire monographs are devoted to the subject [34, 26]. Since the TSP is NP-hard, polynomial-time approximation algorithms are usually studied. However, usually the approaches to the...
متن کاملModels and Algorithms for Online Server Routing
Acknowledgments I wish to thank my advisor Giorgio Ausiello for being interested in working with me since the very beginning. Knocking at his door has definitely been a good idea. Among other things, Giorgio introduced me to many people in the Algorithms community, and most importantly to Leen Stougie, who soon became my coadvisor. I am extremely grateful to Leen for his role in this joint Ph.D...
متن کاملThe online k-server problem with rejection
Cím: The online k-server problem with rejection Folyóirat:
متن کاملOnline multi-server dial-a-ride problems
In an online dial-a-ride problem, a crew of servers has to process transportation requests as they arrive in real time. Possible objective functions include minimizing the makespan and minimizing the sum of completion times. We give competitive algorithms and negative results for several online dial-a-ride problems with multiple servers. Surprisingly, in some cases the competitive ratio is dram...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theory of Computing Systems
سال: 2008
ISSN: 1432-4350,1433-0490
DOI: 10.1007/s00224-008-9103-4